Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows
نویسندگان
چکیده
منابع مشابه
Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows
This paper presents a new non-greedy routing and admission control algorithm for the dynamic routing of bandwidth-guaranteed tunnels. The algorithm operates online that is handling requests which arrive one at a time without prior knowledge of the traf®c pattern. It combines the key concepts in the minimum interference routing algorithm and the algorithms developed based on theoretic competitiv...
متن کاملLoad Profiling Based Routing for Guaranteed Bandwidth Flows
To support the stringent Quality of Service (QoS) requirements of real-time (e.g. audio/video) applications in integrated services networks, several routing algorithms that allow for the reservation of the needed bandwidth over a Virtual Circuit (VC), established on one of several candidate routes, have been proposed. Traditionally, such routing is done using the least-loaded concept, and thus ...
متن کاملA Load Profiling Approach to Routing Guaranteed Bandwidth Flows
We study a new approach to routing multi-class traf-c ows with guaranteed bandwidth requirements. The approach is based on our recently proposed concept of load prooling 4]. We thoroughly characterize routing performance using load prooling and contrast it to routing using load balancing and load packing. We do so both analytically and via extensive simulations on Virtual Path (VP) based networ...
متن کاملA Load Pro � ling Approach to Routing Guaranteed Bandwidth Flows �
We study a new approach to routing multi class traf c ows with guaranteed bandwidth requirements The approach is based on our recently proposed concept of load pro ling We thoroughly characterize routing performance using load pro ling and contrast it to rout ing using load balancing and load packing We do so both analytically and via extensive simulations on Vir tual Path VP based networks Our...
متن کاملNew Bandwidth Guaranteed QoS Routing Algorithm for MPLS Networks
Internet has become an integrated carrier gradually, which has multi business such as data, voice, video, multimedia and so on. New multimedia applications require the network to guarantee quality of service. MPLS network has the capability of routing with some specific constraints for supporting desired QoS, out of which bandwidth is the most important constraint. The efficient routing algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Communications
سال: 2002
ISSN: 0140-3664
DOI: 10.1016/s0140-3664(02)00055-5